Algebraic multigrid for higher-order finite elements
نویسنده
چکیده
Two related approaches for solving linear systems that arise from a higher-order finite element discretization of elliptic partial differential equations are described. The first approach explores direct application of an algebraic-based multigrid method (AMG) to iteratively solve the linear systems that result from higher-order discretizations. While the choice of basis used on the discretization has a significant impact on the performance of the solver, results indicate that AMG is capable of solving operators from both Poisson!s equation and a first-order system least-squares (FOSLS) formulation of Stoke!s equation in a scalable manner, nearly independent of basis order, p, for 3 < p 6 8. The second approach incorporates preconditioning based on a bilinear finite element mesh overlaying the entire set of degrees of freedom in the higher-order scheme. AMG is applied to the operator based on bilinear finite elements and is used as a preconditioner in a conjugate gradient (CG) iteration to solve the algebraic system derived from the high-order discretization. This approach is also nearly independent of p. Although the total iteration count is slightly higher than using AMG accelerated by CG directly on the high-order operator, the preconditioned approach has the advantage of a straightforward matrix-free implementation of the high-order operator, thereby avoiding typically large computational and storage costs. ! 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Algebraic Multigrid Preconditioning of High-Order Spectral Elements for Elliptic Problems on a Simplicial Mesh
Algebraic multigrid is investigated as a solver for linear systems that arise from high-order spectral element discretizations. An algorithm is introduced that utilizes the efficiency of low-order finite elements to precondition the high-order method in a multilevel setting. In particular, the efficacy of this approach is highlighted on simplexes in two and three dimensions with nodal spectral ...
متن کاملAlgebraic Multigrid for High-Order Hierarchical H(curl) Finite Elements
Classic multigrid methods are often not directly applicable to nonelliptic problems such as curl-type partial differential equations (PDEs). Curl-curl PDEs require specialized smoothers that are compatible with the gradient-like (near) null space. Moreover, recent developments have focused on replicating the grad-curl-div de Rham complex in a multilevel hierarchy through smoothed aggregation ba...
متن کاملThe hp-multigrid method applied to hp-adaptive refinement of triangular grids
Recently the hp version of the finite element method, in which adaptivity occurs in both the size, h, of the elements and in the order, p, of the approximating piecewise polynomials, has received increasing attention. It is desirable to combine this optimal order discretization method with an optimal order algebraic solution method, such as multigrid. An intriguing notion is to use the values o...
متن کاملA general framework for multigrid methods for mortar finite elements
In this paper, a general framework for the analysis of multigrid methods for mortar finite elements is considered. The numerical realization is based on the algebraic saddle point formulation arising from the discretization of second order elliptic equations on nonmatching grids. Suitable discrete Lagrange multipliers on the interface guarantee weak continuity and an optimal discretization sche...
متن کاملAlgebraic Multigrid by Component Splitting for Edge Elements on Simplicial Triangulations
Our focus is on Maxwell’s equations in the low frequency range; two specific applications we aim at are time-stepping schemes for eddy current computations and the stationary double-curl equation for time-harmonic fields. We assume that the computational domain is discretized by triangles or tetrahedrons; for the finite element approximation we choose Nédélec’s H( url)-conforming edge elements ...
متن کامل